//
// Created by guasen on 2023/4/15.
//
#include "iostream"
#include "set"
using namespace std;
//测试find函数
//事实证明set的find函数是可以无序比较的
int main(){
    set<int> s1{0,1,2};
    set<int> s2{0,2,1};
    set<int> s3{1,1,1};
    set<set<int>> S;
    S.insert(s1);
    cout << (S.find(s1) == S.end());
    cout << (S.find(s2) == S.end());
    cout << (S.find(s3) == S.end());

}